Optimal Replication of Series-Parallel Graphs for Computation-Intensive Applications

Optimal Replication of Series-Parallel Graphs for Computation-Intensive Applications

Transputer Based Massively Parallel Architecture with Computation Intensive Applications 1

In this paper we present a massively parallel reconngurable system architecture, POPA (POstech PArallel computer) with computation intensive applications. It uses a reconng-urable interconnection network which can be dynamically controlled by software, providing the users with great exibility to choose the most eecient interconnection topology for their application. It consists of 64 processing...

Parallel Algorithms for Series Parallel Graphs

In this paper, a parallel algorithm is given that, given a graph G = (V;E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log jEj log jEj) time and O(jEj) operations on an EREW PRAM, and O(log jEj) time and O(jEj) operations on a CRCW PRAM (note that ifG is a simple series parallel graph,...

Equistable series-parallel graphs

A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We characterize those series-parallel graphs that are equistable, generalizing results of Mahadev, Peled and Sun about equistable outer-planar graphs.

Parallel Recognition of Series-Parallel Graphs

Recently, He and Yesha gave an algorithm for recognizing directed series parallel graphs, in time O(log n) with linearly many EREW processors. We give a new algorithm for this problem, based on a structural characterization of series parallel graphs in terms of their ear decompositions. Our algorithm can recognize undirected as well as directed series parallel graphs. It can be implemented in t...